A Comparison of Solvers for Propositional Dynamic Logic
نویسندگان
چکیده
Calculi for propositional dynamic logics have been investigated since the introduction of this logic in the late seventies. Only in recent years have practical procedures been suggested and implemented. In this paper, we compare three such systems, namely, the Tableau Workbench by Abate, Goré, and Widmann (2009), the pdlProver system by Goré and Widmann (2009), and the MLSolver system by Friedmann and Lange (2009).
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملExploiting Dynamically Propositional Logic Structures in SAT
The 32-bit hwb (hwb-n32 for short) problem is from equivalence checking that arises in combining two circuits computing the hidden weighted bit function. Since 2002, it remains still unsolvable in every SAT competition. This paper focuses on solving problems such as hwb-n32. Generally speaking, modern solvers can detect only XOR, AND, OR and ITE gates. Other non-clausal formulas (propositional ...
متن کاملViscous Models Comparison in Water Impact of Twin 2D Falling Wedges Simulation by Different Numerical Solvers
In this paper, symmetric water entry of twin wedges is investigated for deadrise angle of 30 degree. Three numerical simulation of a symmetric impact, considering rigid body dynamic equations of motion in two-phase flow is presented. The two-phase flow around the wedges is solved by Finite Element based on Finite Volume method (FEM-FVM) which is used in conjunction with Volume of Fluid (VOF) sc...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملLocal-Search Techniques for Propositional Logic Extended with Cardinality Constraints
We study local-search satisfiability solvers for propositional logic extended with cardinality atoms, that is, expressions that provide explicit ways to model constraints on cardinalities of sets. Adding cardi-nality atoms to the language of propositional logic facilitates modeling search problems and often results in concise encodings. We propose two " native " local-search solvers for theorie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010